Note: due-date assignment to multi-job customer ordersBAGCHI, U; JULIEN, F. M; MAGAZINE, M. J et al.Management science. 1994, Vol 40, Num 10, pp 1389-1392, issn 0025-1909Article

A note on Schedule of n jobs on two identical machines to minimize weighted mean flow timeWEBSTER, S.Computers & industrial engineering. 1994, Vol 26, Num 4, pp 795-796, issn 0360-8352Article

A two-phased approach to setting due-dates in single machine job shopsVERAL, E. A; MOHAN, R. P.Computers & industrial engineering. 1999, Vol 36, Num 1, pp 201-218, issn 0360-8352Article

Scheduling under the due date criterion with varying penalties for latenessPAPPIS, C. P; ADAMOPOULOS, G. I.Yugoslav journal of operations research. 1993, Vol 3, Num 2, pp 189-198, issn 0354-0243Article

Multi-objective scheduling with fuzzy due-dateMURATA, T; GEN, M; ISHIBUCHI, H et al.Computers & industrial engineering. 1998, Vol 35, Num 3-4, pp 439-442, issn 0360-8352Conference Paper

Some remarks on the decomposition properties of the single machine total tardiness problemSZWARC, Wlodzimierz.European journal of operational research. 2007, Vol 177, Num 1, pp 623-625, issn 0377-2217, 3 p.Article

Negotiating due-dates between customers and producersLAWRENCE, S. R.International journal of production economics. 1994, Vol 37, Num 1, pp 127-138, issn 0925-5273Article

Multi-job cutting stock problem with due dates and release datesLI, S.The Journal of the Operational Research Society. 1996, Vol 47, Num 4, pp 490-510, issn 0160-5682Article

Note on scheduling with general learning curves to minimize the number of tardy jobsMOSHEIOV, G; SIDNEY, J. B.The Journal of the Operational Research Society. 2005, Vol 56, Num 1, pp 110-112, issn 0160-5682, 3 p.Article

An improved heuristic for the single-machine, weighted-tardiness problemHOLSENBACK, J. E; RUSSELL, R. M; MARKLAND, R. E et al.Omega (Oxford). 1999, Vol 27, Num 4, pp 485-495, issn 0305-0483Article

Scheduling in job shops with machine breakdowns : an experimental studyHOLTHAUS, O.Computers & industrial engineering. 1999, Vol 36, Num 1, pp 137-162, issn 0360-8352Article

On the complexity of two-machine flowshop problems with due date related objectivesKOULAMAS, C.European journal of operational research. 1998, Vol 106, Num 1, pp 95-100, issn 0377-2217Article

Common due-date determination and sequencing using tabu searchHAO, Q; YANG, Z; WANG, D et al.Computers & operations research. 1996, Vol 23, Num 5, pp 409-417, issn 0305-0548Article

Optimal assignment of due-dates for preemptive single-machine schedulingCHENG, T. C. E; GORDON, V. S.Mathematical and computer modelling. 1994, Vol 20, Num 2, pp 33-40, issn 0895-7177Article

Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination methodXIANGTONG QI; TU, F.-S.European journal of operational research. 1998, Vol 105, Num 3, pp 502-508, issn 0377-2217Article

Overtime scheduling : An application in finite-capacity real-time schedulingAKKAN, C.The Journal of the Operational Research Society. 1996, Vol 47, Num 9, pp 1137-1149, issn 0160-5682Article

Single machine scheduling with flow allowancesADAMOPOULOS, G. I; PAPPIS, C. P.The Journal of the Operational Research Society. 1996, Vol 47, Num 10, pp 1280-1285, issn 0160-5682Article

The weighted common due date single machine scheduling problem revisitedSZWARC, W.Computers & operations research. 1996, Vol 23, Num 3, pp 255-262, issn 0305-0548Article

Processing-plus-wait due dates in single-machine schedulingKAHLBACHER, H. G; CHENG, T. C. E.Journal of optimization theory and applications. 1995, Vol 85, Num 1, pp 163-186, issn 0022-3239Article

On the single machine total tardiness problemTIAN, Z. J; NG, C. T; CHENG, T. C. E et al.European journal of operational research. 2005, Vol 165, Num 3, pp 843-846, issn 0377-2217, 4 p.Article

Anwendungsentwicklung in zeitrestriktiven dynamischen Projekten = Application development in time restricted dynamic projectsBRANDT-POOK, Hans; KORZEN, Bernd; BOIDOL, Joachim et al.Wirtschaftsinformatik. 2001, Vol 43, Num 3, pp 247-254, issn 0937-6429Article

On polynomial solvability of the high multiplicity total weighted tardiness problemGRANOT, F; SKORIN-KAPOV, J.Discrete applied mathematics. 1993, Vol 41, Num 2, pp 139-146, issn 0166-218XArticle

Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervalsGORDON, Valery S; WERNER, F; YANUSHKEVICH, O. A et al.Operations research. 2001, Vol 35, Num 1, pp 71-83Article

A note on the bicriterion scheduling problem involving total flowtime and range of latenessALIDAEE, B; CONLON, S.International journal of information and management sciences. 1997, Vol 8, Num 2, pp 1-7, issn 1017-1819Article

Insights into two solution procedures for the single machine tardiness problemNAIDU, J. T; GUPTA, J. N. D; ALIDAEE, B et al.The Journal of the Operational Research Society. 2002, Vol 53, Num 7, pp 800-806, issn 0160-5682Article